Two simple ways to find an efficient solution for a multiple objective linear programming problem
نویسندگان
چکیده
منابع مشابه
An L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem
This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...
متن کاملComputing efficient solutions to fuzzy multiple objective linear programming problems
In this paper, we improve the fuzzy compromise approach of Guu and Wu by automatically computing proper membership thresholds instead of choosing them. Indeed, in practice, choosing membership thresholds arbitrarily may result in an infeasible optimization problem. Although we can adjust minimum satisfaction degree to get fuzzy efficient solution, it sometimes makes the process of interactionmo...
متن کاملNine Ways to Find a Solution
The complete history of problem solving in computer sciences is a history of continuous attempts to discover, study, mimic and implement ideas, models, metaphors, and sequences from nature. This paper explores nine different ways of finding a solution and gives examples from computer science. These nine ways are mainly inspired from nature.
متن کاملAn Algorithm for Obtaining Optimal Compromise Solution of a Multi Objective Fuzzy Linear Programming Problem
This paper proposes the method to the solution of multi objective linear programming problems in fuzzy environment. Here attention has been paid to the study of optimal compromise solution for multi objective fuzzy linear programming problems. Two algorithms have been presented to gives efficient solutions as well as an optimal compromise solution. An illustrative example is given to describe o...
متن کاملA New Method For Solving Linear Bilevel Multi-Objective Multi-Follower Programming Problem
Linear bilevel programming is a decision making problem with a two-level decentralized organization. The leader is in the upper level and the follower, in the lower level. This study addresses linear bilevel multi-objective multi-follower programming (LB-MOMFP) problem, a special case of linear bilevel programming problems with one leader and multiple followers where each decision maker has sev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Bulletin
سال: 2018
ISSN: 2451-3148,1224-5178
DOI: 10.2478/bsaft-2018-0002